An Algebra of Ontologies Approximation under Uncertainty

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Algebra for Composing Ontologies

Ontologies are used as a means of expressing agreements to a vocabulary shared by a community in a coherent and consistent manner. As it happens in the Internet, ontologies are created by community members in a decentralized manner, requiring that they be merged before being used by the community. We develop an algabra to do so in the Resource Discription Framework (RDF). To provide formal sema...

متن کامل

An Anytime Approximation for Optimizing Policies Under Uncertainty

The paper presents a scheme for approximation for the task of maximizing the expected utility over a set of policies, that is, a set of possible ways of reacting to observations about an uncertain state of the world. The scheme which is based on the mini-bucket idea for approximating variable elimination algorithms, is parameterized, allowing a exible control between e ciency and accuracy. Furt...

متن کامل

Approximation algorithms for combinatorial optimization under uncertainty

Combinatorial optimization problems arise in many fields of industry and technology, where they are frequently used in production planning, transportation, and communication network design. Whereas in the context of classical discrete optimization it is usually assumed that the problem inputs are known, in many real-world applications some of the data may be subject to an uncertainty, often bec...

متن کامل

Optimization under Uncertainty Optimization Under Uncertainty: An Overview

Optimization under Uncertainty Optimization under Uncertainty: An Overview Urmila Diwekar . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 Two-Stage Stochastic Linear Programming: A Tutorial Vicente Rico-Ramirez . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 Combinatorial Optimization under Uncertainty Ki-Joo Kim . . . . . . . . . . . . . . . . . . . . . . . . . . ...

متن کامل

Approximation of Ontologies in CASL

In this paper we present methods to generate a Description Logic (DL) theory from a given First Order Logic (FOL) theory, such that each DL axiom is entailed by the given FOL theory. This is obtained by rewriting the given FOL formulas. If this method is applied to an ontology specification in FOL the resulting DL specification is still grounded on the same semantics but clearly weaker than the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Intelligence Science

سال: 2014

ISSN: 2163-0283,2163-0356

DOI: 10.4236/ijis.2014.42007